Inclusion-Exclusion Formulas from Independent Complexes
نویسندگان
چکیده
منابع مشابه
Inclusion-exclusion for k-CNF formulas
We show that the number of satisfying assignments of a k-CNF formula is determined uniquely from the numbers of unsatisfying assignments for clause-sets of size up to ⌊log k⌋+ 2. The information of this size is also shown to be necessary. key words: combinatorial problems; SAT; k-CNF formula; counting; inclusion-exclusion
متن کاملA Note on Approximating Inclusion-Exclusion for k-CNF Formulas
The number of satisfying assignments of k-CNF formulas is computed using the inclusion-exclusion formula for sets of clauses. Recently, it was shown that the information on the sets of clauses of size ≤ log k + 2 already uniquely determines the number of satisfying assignments of k-CNF formulas [1]. The proof was, however, only existential and no explicit procedure was presented. In this paper,...
متن کاملInclusion-exclusion meets exclusion
When evaluating the inclusion-exclusion expansion N0 −N(1) −N(2) − · · ·+N(1, 2) +N(1, 3) + · · · many of the terms N(· · ·) may turn out to be zero, and hence should be discarded beforehand. Often this can be done.
متن کاملThe Inclusion-Exclusion Principle for IF-States
Applying two definitions of the union of IF-events, P. Grzegorzewski gave two generalizations of the inclusion-exclusion principle for IF-events.In this paper we prove an inclusion-exclusion principle for IF-states based on a method which can also be used to prove Grzegorzewski's inclusion-exclusion principle for probabilities on IF-events.Finally, we give some applications of this principle by...
متن کاملQuick Inclusion-Exclusion
Many data mining algorithms make use of the well-known Inclusion-Exclusion principle. As a consequence, using this principle efficiently is crucial for the success of all these algorithms. Especially in the context of condensed representations, such as NDI, and in computing interesting measures, a quick inclusion-exclusion algorithm can be crucial for the performance. In this paper, we give an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2006
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-006-1274-7